Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations

Image restoration is often solved by minimizing an energy function consisting of a datafidelity term and a regularization term. A regularized convex term can usually preserve the image edges well in the restored image. In this paper, we consider a class of convex and edgepreserving regularization functions, i.e., multiplicative half-quadratic regularizations, and we Supported by The National Basic Research Program (No. 2005CB321702) and The National Outstanding Young Scientist Foundation (No. 10525102), P.R. China. Supported in part by HKRGC grants and HKBU FRGs. 1 2 Z.-Z. Bai, Y.-M. Huang, M.K. Ng and X. Yang use the Newton method to solve the correspondingly reduced systems of nonlinear equations. At each Newton iterate, the preconditioned conjugate gradient method, incorporated with a constraint preconditioner, is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix is deliberately derived, which can be used to estimate the convergence speed of the preconditioned conjugate gradient method. We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably well.